Proof Search on Bilateralist Judgments over Non-deterministic Semantics

نویسندگان

چکیده

The bilateralist approach to logical consequence maintains that judgments of different qualities should be taken into account in determining what-follows-from-what. We argue such an may actualized by a two-dimensional notion entailment induced semantic structures also accommodate non-deterministic and partial interpretations, propose proof-theoretical apparatus reason over using symmetrical analytical Hilbert-style calculi. provide proof-search algorithm for finite analytic calculi runs at most exponential time, general, polynomial time when only rules having one formula the succedent are present concerned calculus.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof Net Semantics of Proof Search Computation

We present a sound and complete compositional semantics, structured around certain abstractions of proof nets, for proof-search computation in a linear logic-based language. The model captures the interaction of agents in terms of the actions they engage into and of the dynamic creation of names. The model is adequate for reasoning about a notion of operational equivalence. We will also suggest...

متن کامل

Non-deterministic Boolean Proof Nets

We introduce Non-deterministic Boolean proof nets to study the correspondence with Boolean circuits, a parallel model of computation. We extend the cut elimination of Non-deterministic Multiplicative Linear logic to a parallel procedure in proof nets. With the restriction of proof nets to Boolean types, we prove that the cut-elimination procedure corresponds to Non-deterministic Boolean circuit...

متن کامل

Distance-Based Non-Deterministic Semantics

Representing uncertainty and reasoning with dynamically evolving systems are two related issues that are in the heart of many information systems. In this paper we show that these tasks can be successfully dealt with by incorporating distance semantics and nondeterministic matrices. The outcome is a general framework for capturing the principle of minimal change and providing a non-deterministi...

متن کامل

Non-deterministic Semantics for Dynamic Topological Logic

Dynamic Topological Logic (DT L) is a combination of S4, under its topological interpretation, and the temporal logic LT L interpreted over the natural numbers. DT L is used to reason about properties of dynamical systems based on topological spaces. Semantics are given by dynamic topological models, which are tuples 〈X, T , f, V 〉, where 〈X, T 〉 is a topological space, f a function on X and V ...

متن کامل

A Non-Deterministic Semantics for Tractable Inference

Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a ∧ b ⊃ c, then c should be an obvious implication. However, devising a tractable semantics that allows unit resolution has proven to be an elusive goal. We propose a 3-valued semantics for a tractable fragment of propositional logic that is inherently ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-86059-2_8